Rezumat articol ediţie STUDIA UNIVERSITATIS BABEŞ-BOLYAI

În partea de jos este prezentat rezumatul articolului selectat. Pentru revenire la cuprinsul ediţiei din care face parte acest articol, se accesează linkul din titlu. Pentru vizualizarea tuturor articolelor din arhivă la care este autor/coautor unul din autorii de mai jos, se accesează linkul din numele autorului.

 
       
         
    STUDIA INFORMATICA - Ediţia nr.Sp.Issue 1 din 2009  
         
  Articol:   COMPACTING SYNTACTIC PARSE TREES INTO ENTITY RELATIONSHIP GRAPHS.

Autori:  PÉTER SZILÁGYI. 		 
       
         
  Rezumat:   At the moment computers are only able to extract useful information from natural language using known patterns, reason for which they can only reach the tip of the information iceberg contained within the texts. To gain more information, shallow parsing techniques are no longer powerful enough, other methods are needed, which can execute deep parsing on the texts to determine the semantic elements and their relationships. A new approach is introduced, with which the result of syntactic parsers canbe further processed to create a graph that is much more tractable for computer programs. This goal was achieved in the following three steps: the enrollment ofthe words of the text into important semantic categories; the extraction of the relationships between the categorized words using syntactic rules based on the syntactic parse tree; and the disambiguation of multi-sense relationships using aprobabilistic model constructed with maximum entropy.

Key words and phrases. syntactic parser, semantic parser, maximum entropy. 		 
         
     
         
         
      Revenire la pagina precedentă